FindPostmanTour

FindPostmanTour[g] finds a Chinese postman tour in the graph g of minimal length.

FindPostmanTour[g,k] finds at most k Chinese postman tours. 

FindPostmanTour[{v->w,…},…] uses rules v->w to specify the graph g.

Please visit the official Wolfram Language Reference for more details and examples on core symbols.